Group Communication Patterns for High Performance Computing in Scala

We developed a Functional object-oriented Parallel framework (FooPar) for high-level high-performance computing in Scala. Central to this framework are Distributed Memory Parallel Data structures (DPDs), i.e., collections of data distributed in a shared nothing system together with parallel operations on these data. In this paper, we first present FooPar's architecture and the idea of DPDs and group communications. Then, we show how DPDs can be implemented elegantly and efficiently in Scala based on the Traversable/Builder pattern, unifying Functional and Object-Oriented Programming. We prove the correctness and safety of one communication algorithm and show how specification testing (via ScalaCheck) can be used to bridge the gap between proof and implementation. Furthermore, we show that the group communication operations of FooPar outperform those of the MPJ Express open source MPI-bindings for Java, both asymptotically and empirically. FooPar has already been shown to be capable of achieving close-to-optimal performance for dense matrix-matrix multiplication via JNI. In this article, we present results on a parallel implementation of the Floyd-Warshall algorithm in FooPar, achieving more than 94 % efficiency compared to the serial version on a cluster using 100 cores for matrices of dimension 38000 x 38000

Distributed Random Process for a Large-Scale Peer-to-Peer Lottery

Most online lotteries today fail to ensure the verifiability of the random process and rely on a trusted third party. This issue has received little attention since the emergence of distributed protocols like Bitcoin that demonstrated the potential of protocols with no trusted third party. We argue that the security requirements of online lotteries are similar to those of online voting, and propose a novel distributed online lottery protocol that applies techniques developed for voting applications to an existing lottery protocol. As a result, the protocol is scalable, provides efficient verification of the random process and does not rely on a trusted third party nor on assumptions of bounded computational resources. An early prototype confirms the feasibility of our approach

Breakdown of the Landauer bound for information erasure in the quantum regime

A known aspect of the Clausius inequality is that an equilibrium system subjected to a squeezing \d S of its entropy must release at least an amount |\dbarrm Q|=T|\d S| of heat. This serves as a basis for the Landauer principle, which puts a lower bound $T\ln 2$ for the heat generated by erasure of one bit of information. Here we show that in the world of quantum entanglement this law is broken. A quantum Brownian particle interacting with its thermal bath can either generate less heat or even {\it adsorb} heat during an analogous squeezing process, due to entanglement with the bath. The effect exists even for weak but fixed coupling with the bath, provided that temperature is low enough. This invalidates the Landauer bound in the quantum regime, and suggests that quantum carriers of information can be much more efficient than assumed so far.Comment: 13 pages, revtex, 2 eps figure

Broadband 300-GHz Power Amplifier MMICs in InGaAs mHEMT Technology

In this article, we report on compact solid-state power amplifier (SSPA) millimeter-wave monolithic integrated circuits (MMICs) covering the 280–330-GHz frequency range. The technology used is a 35-nm gate-length InGaAs metamorphic highelectron- mobility transistor (mHEMT) technology. Two power amplifier MMICs are reported, based on a compact unit amplifier cell, which is parallelized two times using two different Wilkinson power combiners. The Wilkinson combiners are designed using elevated coplanar waveguide and air-bridge thin-film transmission lines in order to implement low-loss 70-Ω lines in the back-endof-line of this InGaAs mHEMT technology. The five-stage SSPA MMICs achieve a measured small-signal gain around 20 dB over the 280–335-GHz frequency band. State-of-the-art output power performance is reported, achieving at least 13 dBm over the 286–310-GHz frequency band, with a peak output power of 13.7 dBm (23.4 mW) at 300 GHz. The PA MMICs are designed for a reduced chip width while maximizing the total gate width of 512 μm in the output stage, using a compact topology based on cascode and common-source devices, improving the output power per required chip width significantly

Distributed Management of Massive Data: an Efficient Fine-Grain Data Access Scheme

This paper addresses the problem of efficiently storing and accessing massive data blocks in a large-scale distributed environment, while providing efficient fine-grain access to data subsets. This issue is crucial in the context of applications in the field of databases, data mining and multimedia. We propose a data sharing service based on distributed, RAM-based storage of data, while leveraging a DHT-based, natively parallel metadata management scheme. As opposed to the most commonly used grid storage infrastructures that provide mechanisms for explicit data localization and transfer, we provide a transparent access model, where data are accessed through global identifiers. Our proposal has been validated through a prototype implementation whose preliminary evaluation provides promising results

Cellular Internalization of Human Calcitonin Derived Peptides in MDCK Monolayers: A Comparative Study with Tat(47-57) and Penetratin(43-58)

ISSN:0724-8741ISSN:1573-904

Human phosphodiesterase 4D7 (PDE4D7) expression is increased in TMPRSS2-ERG positive primary prostate cancer and independently adds to a reduced risk of post-surgical disease progression

background: There is an acute need to uncover biomarkers that reflect the molecular pathologies, underpinning prostate cancer progression and poor patient outcome. We have previously demonstrated that in prostate cancer cell lines PDE4D7 is downregulated in advanced cases of the disease. To investigate further the prognostic power of PDE4D7 expression during prostate cancer progression and assess how downregulation of this PDE isoform may affect disease outcome, we have examined PDE4D7 expression in physiologically relevant primary human samples. methods: About 1405 patient samples across 8 publically available qPCR, Affymetrix Exon 1.0 ST arrays and RNA sequencing data sets were screened for PDE4D7 expression. The TMPRSS2-ERG gene rearrangement status of patient samples was determined by transformation of the exon array and RNA seq expression data to robust z-scores followed by the application of a threshold >3 to define a positive TMPRSS2-ERG gene fusion event in a tumour sample. results: We demonstrate that PDE4D7 expression positively correlates with primary tumour development. We also show a positive association with the highly prostate cancer-specific gene rearrangement between TMPRSS2 and the ETS transcription factor family member ERG. In addition, we find that in primary TMPRSS2-ERG-positive tumours PDE4D7 expression is significantly positively correlated with low-grade disease and a reduced likelihood of progression after primary treatment. Conversely, PDE4D7 transcript levels become significantly decreased in castration resistant prostate cancer (CRPC). conclusions: We further characterise and add physiological relevance to PDE4D7 as a novel marker that is associated with the development and progression of prostate tumours. We propose that the assessment of PDE4D7 levels may provide a novel, independent predictor of post-surgical disease progression

Modeling of Transient Flow Mixing of Streams Injected into a Mixing Chamber

Ignition is recognized as one the critical drivers in the reliability of multiple-start rocket engines. Residual combustion products from previous engine operation can condense on valves and related structures thereby creating difficulties for subsequent starting procedures. Alternative ignition methods that require fewer valves can mitigate the valve reliability problem, but require improved understanding of the spatial and temporal propellant distribution in the pre-ignition chamber. Current design tools based mainly on one-dimensional analysis and empirical models cannot predict local details of the injection and ignition processes. The goal of this work is to evaluate the capability of the modern computational fluid dynamics (CFD) tools in predicting the transient flow mixing in pre-ignition environment by comparing the results with the experimental data. This study is a part of a program to improve analytical methods and methodologies to analyze reliability and durability of combustion devices. In the present paper we describe a series of detailed computational simulations of the unsteady mixing events as the cold propellants are first introduced into the chamber as a first step in providing this necessary environmental description. The present computational modeling represents a complement to parallel experimental simulations' and includes comparisons with experimental results from that effort. A large number of rocket engine ignition studies has been previously reported. Here we limit our discussion to the work discussed in Refs. 2, 3 and 4 which is both similar to and different from the present approach. The similarities arise from the fact that both efforts involve detailed experimental/computational simulations of the ignition problem. The differences arise from the underlying philosophy of the two endeavors. The approach in Refs. 2 to 4 is a classical ignition study in which the focus is on the response of a propellant mixture to an ignition source, with emphasis on the level of energy needed for ignition and the ensuing flame propagation issues. Our focus in the present paper is on identifying the unsteady mixing processes that provide the propellant mixture in which the ignition source is to be placed. In particular, we wish to characterize the spatial and temporal mixture distribution with a view toward identifying preferred spatial and temporal locations for the ignition source. As such, the present work is limited to cold flow (pre-ignition) condition

Number partitioning as random energy model

Number partitioning is a classical problem from combinatorial optimisation. In physical terms it corresponds to a long range anti-ferromagnetic Ising spin glass. It has been rigorously proven that the low lying energies of number partitioning behave like uncorrelated random variables. We claim that neighbouring energy levels are uncorrelated almost everywhere on the energy axis, and that energetically adjacent configurations are uncorrelated, too. Apparently there is no relation between geometry (configuration) and energy that could be exploited by an optimization algorithm. This ``local random energy'' picture of number partitioning is corroborated by numerical simulations and heuristic arguments.Comment: 8+2 pages, 9 figures, PDF onl

Adaptive Optics for Astronomy

Adaptive Optics is a prime example of how progress in observational astronomy can be driven by technological developments. At many observatories it is now considered to be part of a standard instrumentation suite, enabling ground-based telescopes to reach the diffraction limit and thus providing spatial resolution superior to that achievable from space with current or planned satellites. In this review we consider adaptive optics from the astrophysical perspective. We show that adaptive optics has led to important advances in our understanding of a multitude of astrophysical processes, and describe how the requirements from science applications are now driving the development of the next generation of novel adaptive optics techniques.Comment: to appear in ARA&A vol 50, 201